A Modified Diagonal Mesh Shuffle Exchange Interconnection Network

Performance Analysis of a New Neural Network for Routing in Mesh Interconnection Networks

Routing is one of the basic parts of a message passing multiprocessor system. The routing procedure has a great impact on the efficiency of a system. Neural algorithms that are currently in use for computer networks require a large number of neurons. If a specific topology of a multiprocessor network is considered, the number of neurons can be reduced. In this paper a new recurrent neural ne...

Performance Analysis of a New Neural Network for Routing in Mesh Interconnection Networks

Routing is one of the basic parts of a message passing multiprocessor system. The routing procedure has a great impact on the efficiency of a system. Neural algorithms that are currently in use for computer networks require a large number of neurons. If a specific topology of a multiprocessor network is considered, the number of neurons can be reduced. In this paper a new recurrent neural ne...

On The Shuffle-Exchange Permutation Network

The shuffle-exchange permutation network (SEPn) is a fixed degree Cayley graph which has been proposed as a basis for massively parallel systems. We propose a routing algorithm with an upper bound of (5/8)n + O(n), where n is the length of the permutation. (This improves on a (9/8)n routing algorithm described earlier [5].) Thus, the diameter of SEPn is at most (5/8) n 2 + O(n). We also show th...

A Torus Assignment for an Interconnection Network Recursive Diagonal Torus

Recursive Diagonal Torus (RDT) is a class of interconnection network consisting of recursively overlaid twodimensional square diagonal tori for massively parallel computers with up to 2 nodes. Connection structures of the RDT vary according to the assignment of upper rank diagonal tori into a node. Although traditional simple assignment called RDT(2,4,1)/ shows enough performance under the unif...

Shuffle-Exchange Mesh Topology for Networks-on-Chip